n, a, x, b, y = map(int, input().split())
while a != x and b != y:
if a == b:
print("YES")
exit(0)
if a == n and b == 1:
a = 1
b = n
elif a == n and b != 1:
a = 1
b -= 1
elif a != n and b == 1:
a += 1
b = n
else:
a += 1
b -= 1
if a == b:
print("YES")
exit(0)
print("NO")
// Problem: A. Circle Metro
// Contest: Codeforces - Codeforces Round #562 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1169/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n, a, x, b, y;
cin >> n >> a >> x >> b >> y;
a--, x--, b--, y--;
while (true)
{
if (a == b) {
cout << "YES\n";
return 0;
}
if (a == x || b == y)
{
break;
}
a = (a + 1) % n;
b = (b - 1 + n) % n;
}
cout << "NO\n";
}1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |
1633C - Kill the Monster | 1611A - Make Even |
1030B - Vasya and Cornfield | 1631A - Min Max Swap |
1296B - Food Buying | 133A - HQ9+ |
1650D - Twist the Permutation | 1209A - Paint the Numbers |
1234A - Equalize Prices Again | 1613A - Long Comparison |
1624B - Make AP | 660B - Seating On Bus |
405A - Gravity Flip | 499B - Lecture |
709A - Juicer | 1358C - Celex Update |
1466B - Last minute enhancements | 450B - Jzzhu and Sequences |